Minimizing Warehouse Space with a Dedicated Storage Policy
نویسندگان
چکیده
منابع مشابه
A Linear Storage-Retrieval Policy for Robust Warehouse Management
Assigning products to and retrieving them from proper storage locations in a unit-load warehouse are crucial in minimizing its operating cost. The problem becomes intractable when the warehouse faces uncertain demand in a dynamic setting. We assume a factor-based demand model in which demand for each product in each period is affinely dependent on some uncertain factors. The distributions of th...
متن کاملOptimizing the Rearrangement Process in a Dedicated Warehouse
Determining the optimal storage assignment for products in a dedicated warehouse has been addressed extensively in the Facility Logistics literature. However, the process of implementing a particular storage assignment given the current location of products has not received much attention in the existing literature. Typically, warehouses use downtime or overtime to remove products from their cu...
متن کاملOptimal placement of warehouse cross aisles in a picker-to-part warehouse with class-based storage
Given a picker-to-part warehouse having a simple rectilinear aisle arrangement with north2 south storage aisles and east-west travel aisles (or “cross aisles”), this paper investigates the 3 optimal placement of the cross aisles as a consequence of the probability density function of the 4 order pick locations, as determined by the storage policy. That is, for a given storage policy, 5 what pla...
متن کاملA Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics
In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the “Bin Packing Problem” where bins represent available storage space and the p...
متن کاملA Modified Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems
Adaptive space-sharing algorithms are commonly used to realize the fullest strengths of dedicated homogeneous cluster computing systems since they produce better performance than fixed and variable-space sharing policies. However cluster of computers tend to be heterogeneous over the time because of both nature of incremental growth and diversity of technological change. Community-owned cluster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Business Management
سال: 2013
ISSN: 1847-9790,1847-9790
DOI: 10.5772/56756